Numerical stability criteria for di erential-algebraic systems
نویسنده
چکیده
In this paper we transfer classical results concerning Lyapunov stability of stationary solutions x to the classes of DAEs being most interesting for circuit simulation, thereby keeping smoothness as low as possible. We formulate all criteria in terms of the original equation. Those simple matrix criteria for checking regularity, Lyapunov stability etc. are easily realized numerically.
منابع مشابه
Asymptotic Stability of Linear Delay Di erential Algebraic Equations and Numerical Methods
In this paper, we consider the asymptotic stability of linear constant coeecient delay diierential-algebraic equations and of-methods, Runge-Kutta methods and linear multistep methods applied to these systems.
متن کاملAdjoint sensitivity analysis for di$erential-algebraic equations: algorithms and software
An e4cient numerical method for sensitivity computation of large-scale di$erential-algebraic systems is developed based on the adjoint method. Issues that are critical for the implementation are addressed. Complexity analysis and numerical results demonstrate that the adjoint sensitivity method is advantageous over the forward sensitivity method for applications with a large number of sensitivi...
متن کاملNumerical Solution of fuzzy differential equations of nth-order by Adams-Bashforth method
So far, many methods have been presented to solve the rst-order di erential equations. But, not many studies have been conducted for numerical solution of high-order fuzzy di erential equations. In this research, First, the equation by reducing time, we transform the rst-order equation. Then we have applied Adams-Bashforth multi-step methods for the initial approximation of one order di erentia...
متن کاملDifferential Algebraic Systems Anew
Linear di erential algebraic equations with properly stated leading term are considered via a decoupling into their essential parts. It is shown why for so-called numerically well formulated equations the decoupling and discretizations commute in some sense. In general one cannot expect this commutativity so that additional diÆculties like strong stepsize restrictions may arise. Moreover, abstr...
متن کاملDiierential Elimination-completion Algorithms for Dae and Pdae
dae and pdae are systems of ordinary and partial di erential-algebraic equations with constraints. They occur frequently in applications such as constrained multibody mechanics, space-craft control and incompressible uid dynamics. A dae has di erential index r if a minimum of r+1 di erentiations of it are required before no new constraints are obtained. While dae of low di erential index (0 or ...
متن کامل